Local Search Techniques for Temporal Planning in LPG
نویسندگان
چکیده
We present some techniques for planning in temporal domains specified with the recent standard languange PDDL2.1. These techniques are implemented in LPG, a fully-automated system that took part in the third International Planning Competition (Toulouse, 2002) showing excellent performance. The planner is based on a stochastic local search method and on a graph-based representation called “Temporal Action Graphs” (TA-graphs). In this paper we present some new heuristics to guide the search in LPG using this representation. An experimental analysis of the performance of LPG on a large set of test problems used in the competition shows that our techniques can be very effective, and that often our planner outperforms all other fully-automated temporal planners that took part in the contest.
منابع مشابه
Planning Through Stochastic Local Search and Temporal Action Graphs in LPG
We present some techniques for planning in domains specified with the recent standard language pddl2.1, supporting “durative actions” and numerical quantities. These techniques are implemented in lpg, a domain-independent planner that took part in the 3rd International Planning Competition (IPC). lpg is an incremental, any time system producing multi-criteria quality plans. The core of the syst...
متن کاملPlanning with Numerical Expressions in LPG
We present some techniques for handling planning problems with numerical expressions that can be specified using the standard planning language PDDL. These techniques are implemented in LPG, a fully-automated planner based on local search that was awarded at the third international planning competition (2002). First, we present a plan representation for handling numerical expressions called Num...
متن کاملTemporal Planning with Problems Requiring Concurrency through Action Graphs and Local Search
We present an extension of the planning framework based on action graphs and local search to deal with PDDL2.1 temporal problems requiring concurrency, while previously the approach could only solve problems admitting a sequential solution. The paper introduces a revised plan representation supporting concurrency and some new search techniques using it, which are implemented in a new version of...
متن کاملLPG-TD: a Fully Automated Planner for PDDL2.2 Domains
Like the previous version of LPG, the new version is based on a stochastic local search in the space of particular “action graphs” derived from the planning problem specification. In LPG-TD, this graph representation has been extended to deal with the new features of PDDL2.2, as well to improve the management of durative actions and of numerical expressions (already supported by PDDL2.1 (Fox & ...
متن کاملLPG: A Planner Based on Local Search for Planning Graphs with Action Costs
We present LPG, a fast planner using local search for solving planning graphs. LPG can use various heuristics based on a parametrized objective function. These parameters weight different types of inconsistencies in the partial plan represented by the current search state, and are dynamically evaluated during search using Lagrange multipliers. LPG’s basic heuristic was inspired by Walksat, whic...
متن کامل